Top%2DDown and Bottom%2DUp A Combined Approach to Slot Filling.

Motion Dynamics Modelling of an Electric Wheel Robot.

Incorporating post%2Dclick behaviors into a click model.

Learning to rank audience for behavioral targeting.

Learning to rank audience for behavioral targeting.

Using search session context for named entity recognition in query.

A co%2Dlearning framework for learning user search intents from rule%2Dgenerated training data.

A novel click model and its applications to online advertising.
Recent advances in click model have positioned it as an attractive method for representing user preferences in web search and online advertising. Yet, most of the existing works focus on training the click model for individual queries, and cannot accurately model the tail queries due to the lack of training data. Simultaneously, most of the existing works consider the query, url and position, neglecting some other important attributes in click log data, such as the local time. Obviously, the click through rate is different between daytime and midnight. In this paper, we propose a novel click model based on Bayesian network, which is capable of modeling the tail queries because it builds the click model on attribute values, with those values being shared across queries. We called our work General Click Model (GCM) as we found that most of the existing works can be special cases of GCM by assigning different parameters. Experimental results on a largescale commercial advertisement dataset show that GCM can significantly and consistently lead to better results as compared to the state-of-the-art works.

Transfer learning for behavioral targeting.


Cross%2Ddomain sentiment classification via spectral feature alignment.

Error analysis of finite element approximations of the stochastic Stokes equations.

Using Gene Ontology to enhance effectiveness of similarity measures for microarray data.

Knowledge transfer for cross domain learning to rank.

Context%2DAware Online Commercial Intention Detection.
Abstract. With more and more commercial activities moving onto the Internet, people tend to purchase what they need through Internet or conduct some online research before the actual transactions happen. For many Web users, their online commercial activities start from submitting a search query to search engines. Just like the common Web search queries, the queries with commercial intention are usually very short. Recognizing the queries with commercial intention against the common queries will help search engines provide proper search results and advertisements, help Web users obtain the right information they desire and help the advertisers benefit from the potential transactions. However, the intentions behind a query vary a lot for users with different background and interest. The intentions can even be different for the same user, when the query is issued in different contexts. In this paper, we present a new algorithm framework based on skip-chain conditional random field (SCCRF) for automatically classifying Web queries according to context-based online commercial intention. We analyze our algorithm performance both theoretically and empirically. Extensive experiments on several real search engine log datasets show that our algorithm can improve more than 10 % on F1 score than previous algorithms on commercial intention detection. 1
PQC personalized query classification.
Query classification (QC) is a task that aims to classify Web queries into topical categories. Since queries are usually short in length and ambiguous, the same query may need to be classified to different categories according to different people’s perspectives. In this paper, we propose the Personalized Query Classification (PQC) task and develop an algorithm based on user preference learning as a solution. Users ’ preferences that are hidden in clickthrough logs are quite helpful for search engines to improve their understandings of users ’ queries. We propose to connect query classification with users ’ preference learning from clickthrough logs for PQC. To tackle the sparseness problem in clickthrough logs, we propose a collaborative ranking model to leverage similar users ’ information. Experiments on a real world clickthrough log data show that our proposed PQC algorithm can gain significant improvement compared with general QC as well as natural baselines. Our method can be applied to a wide range of applications including personalized search and online advertising.
ExSearch a novel vertical search engine for online barter business.

Exploiting term relationship to boost text classification.

To divide and conquer search ranking by learning query difficulty.

A general magnitude%2Dpreserving boosting algorithm for search ranking.

Cross%2Ddocument Temporal and Spatial Person Tracking System Demonstration.
Traditional Information Extraction (IE) systems identify many unconnected facts. The objective of this paper is to define a new cross-document information extraction task and demonstrate a system which can extract, rank and track events in two dimensions: temporal and spatial. The system can automatically label the person entities involved in significant events as &#039;centroid arguments&#039;, and then order the events involving the same centroid on a time line and on a geographical map. 1
Language Specific Issue and Feature Exploration in Chinese Event Extraction.

An Overview of Prophet.
Prophet is a run-time scheduling system designed to support the efficient execution of parallel applications written in the Mentat programming language [7]. Prior results demonstrated that SPMD applications could be scheduled automatically in a ethernet-based local-area workstation network with good performance [14][16]. This paper describes our recent efforts to extend Prophet along several dimensions, improved overhead control, greater resource sharing, greater resource heterogeneity, wide-area scheduling, and new application types. We show that both SPMD and task parallel applications can be scheduled effectively in a shared heterogeneous LAN environment containing ethernet and ATM networks by exploiting the application structure and dynamic run-time information.  1 1.0 Introduction  Scheduling parallel applications in distributed networks is a complex problem that requires a coordinated effort between the scheduling system and the applications programmer. The complexity arises out ...
Synthesizing Novel Dimension Reduction Algorithms in Matrix Trace Oriented Optimization Framework.

Inverse Time Dependency in Convex Regularized Learning.

P%2DpackSVM Parallel Primal grAdient desCent Kernel SVM.

Analytical and computational modeling of robotic fish propelled by soft actuation material%2Dbased active joints.

Effective multi%2Dlabel active learning for text classification.

A Markov chain model for integrating behavioral targeting into contextual advertising.

Probabilistic latent semantic user segmentation for behavioral targeted advertising.


Revenue optimization with relevance constraint in sponsored search.


Straightforward Feature Selection for Scalable Latent Semantic Indexing.

Optimizing search engine revenue in sponsored search.

Temporal query substitution for ad search.

New e%2DLearning system architecture based on knowledge engineering technology.

A Thread Partitioning Method for Speculative Multithreading.

Competitive analysis from click%2Dthrough log.

A probabilistic model based approach for blended search.

Mining multilingual topics from wikipedia.
Abstract. Topic models have been studied extensively in the context of monolingual corpora. Though there are some attempts to mine topical structure from cross-lingual corpora, they require clues about document alignments. In this paper we present a generative model called JointLDA which uses a bilingual dictionary to mine multilingual topics from an unaligned corpus. Experiments conducted on different data sets confirm our conjecture that jointly modeling the cross-lingual corpora offers several advantages compared to individual monolingual models. Since the JointLDA model merges related topics in different languages into a single multilingual topic: a) it can fit the data with relatively fewer topics. b) it has the ability to predict related words from a language different than that of the given document. In fact it has better predictive power compared to the bag-of-word based translation model leaving the possibility for JointLDA to be preferred over bag-of-word model for cross-lingual IR applications. We also found that the monolingual models learnt while optimizing the cross-lingual copora are more effective than the corresponding LDA models. 1
Identifying vertical search intention of query through social tagging propagation.

Search result re%2Dranking based on gap between search queries and social tags.

Identifying vertical search intention of query through social tagging propagation.

How much can behavioral targeting help online advertising%3F

Understanding user%27s query intent with wikipedia.

Recording Process Documentation in the Presence of Failures.

An online blog reading system by topic clustering and personalized ranking.

Adaptive robust control of linear motors with dynamic friction compensation using modified LuGre model.
Any queries or remarks that have arisen during the processing of your manuscript are listed below and highlighted by flags in the proof. Please check your proof carefully and mark all corrections at the appropriate place in the proof (e.g., by using on-screen annotation in the PDF file) or compile them in a separate list. For correction or revision of any artwork, please consult
Using Wikipedia knowledge to improve text classification.

Mining Translations of Web Queries from Web Click%2Dthrough Data.

Using Gene Ontology to Enhance Effectiveness of Similarity Measures for Microarray Data.

A nonlinear%2C control%2Doriented model for ionic polymer%2Dmetal composite actuators.

Research on Learning Resource Sharing System with Ontology%2DBased Hierarchy Semantic Model.

Learning Bidirectional Similarity for Collaborative Filtering.

Learning the Latent Semantic Space for Ranking in Text Retrieval.

TOFA Trace Oriented Feature Analysis in Text Categorization.


TransRank A Novel Algorithm for Transfer of Rank Learning.


Modeling of biomimetic robotic fish propelled by an ionic polymer%2Dmetal composite actuator.

Implementation and Evaluation of a Protocol for Recording Process Documentation in the Presence of Failures.

Scalable packet classification using interpreting a cross%2Dplatform multi%2Dcore solution.

Enhancing text clustering by leveraging Wikipedia semantics.

Web query translation via web log mining.

Mining Web Query Hierarchies from Clickthrough Data.
In this paper, we propose to mine query hierarchies from clickthrough data, which is within the larger area of automatic acquisition of knowledge from the Web. When a user submits a query to a search engine and clicks on the returned Web pages, the user’s understanding of the query as well as its relation to the Web pages is encoded in the clickthrough data. With millions of queries being submitted to search engines every day, it is both important and beneficial to mine the knowledge hidden in the queries and their intended Web pages. We can use this information in various ways, such as providing query suggestions and organizing the queries. In this paper, we plan to exploit the knowledge hidden in clickthrough logs by constructing query hierarchies, which can reflect the relationship among queries. Our proposed method consists of two stages: generating candidate queries and determining “generalization/specialization” relations between these queries in a hierarchy. We test our method on some labeled data sets and illustrate the effectiveness of our proposed solution empirically.
Shine search heterogeneous interrelated entities.

Improving Text Classification by Using Encyclopedia Knowledge.

Document Transformation for Multi%2Dlabel Feature Selection in Text Categorization.

Local Word Bag Model for Text Categorization.

Feature selection in a kernel space.
We address the problem of feature selection in a kernel space to select the most discriminative and informative features for classification and data analysis. This is a difficult problem because the dimension of a kernel space may be infinite. In the past, little work has been done on feature selection in a kernel space. To solve this problem, we derive a basis set in the kernel space as a first step for feature selection. Using the basis set, we then extend the margin-based feature selection algorithms that are proven effective even when many features are dependent. The selected features form a subspace of the kernel space, in which different state-of-the-art classification algorithms can be applied for classification. We conduct extensive experiments over real and simulated data to compare our proposed method with four baseline algorithms. Both theoretical analysis and experimental results validate the effectiveness of our proposed method.
Detect and Track Latent Factors with Online Nonnegative Matrix Factorization.

Document Summarization Using Conditional Random Fields.
Many methods, including supervised and unsupervised algorithms, have been developed for extractive document summarization. Most supervised methods consider the summarization task as a twoclass classification problem and classify each sentence individually without leveraging the relationship among sentences. The unsupervised methods use heuristic rules to select the most informative sentences into a summary directly, which are hard to generalize. In this paper, we present a Conditional Random Fields (CRF) based framework to keep the merits of the above two kinds of approaches while avoiding their disadvantages. What is more, the proposed framework can take the outcomes of previous methods as features and seamlessly integrate them. The key idea of our approach is to treat the summarization task as a sequence labeling problem. In this view, each document is a sequence of sentences and the summarization procedure labels the sentences by 1 and 0. The label of a sentence depends on the assignment of labels of others. We compared our proposed approach with eight existing methods on an open benchmark data set. The results show that our approach can improve the performance by more than 7.1 % and 12.1 % over the best supervised baseline and unsupervised baseline respectively in terms of two popular metrics F1 and ROUGE-2. Detailed analysis of the improvement is presented as well. 1
Homepage live automatic block tracing for web personalization.
The emergence of personalized homepage services, e.g. personalized Google Homepage and Microsoft Windows Live, has enabled Web users to select Web contents of interest and to aggregate them in a single Web page. The web contents are often predefined content blocks provided by the service providers. However, it involves intensive manual efforts to define the content blocks and maintain the information in it. In this paper, we propose a novel personalized homepage system, called “Homepage Live”, to allow end users to use drag-and-drop actions to collect their favorite Web content blocks from existing Web pages and organize them in a single page. Moreover, Homepage Live automatically traces the changes of blocks with the evolvement of the container pages by measuring the tree edit distance of the selected blocks. By exploiting the immutable
Causal relation of queries from temporal logs.

Query topic detection for reformulation.

A novel clustering%2Dbased RSS aggregator.

Demographic prediction based on user%27s browsing behavior.

A hybrid system for SPC concurrent pattern recognition.

Noise reduction through summarization for Web%2Dpage classification.

Text Classification Improved through Automatically Extracted Sequences.

DCFLA A distributed collaborative%2Dfiltering neighbor%2Dlocating algorithm.

Text classification improved through multigram models.

Text Classification Improved through Automatically Extracted Sequences.

Subjectivity Categorization of Weblog with Part%2Dof%2DSpeech Based Smoothing.

Latent Friend Mining from Blog Data.
The rapid growth of blog (also known as “weblog”) data provides a rich resource for social community mining. In this paper, we put forward a novel research problem of mining the latent friends of bloggers based on the contents of their blog entries. Latent friends are defined in this paper as people who share the similar topic distribution in their blogs. These people may not actually know each other, but they have the interest and potential to find each other out. Three approaches are designed for latent friend detection. The first one, called cosine similarity-based method, determines the similarity between bloggers by calculating the cosine similarity between the contents of the blogs. The second approach, known as topic-based method, is based on the discovery of latent topics using a latent topic model and then calculating the similarity at the topic level. The third one is two-level similarity-based, which is conducted in two stages. In the first stage, an existing topic hierarchy is exploited to build a topic distribution for a blogger. Then, in the second stage, a detailed similarity comparison is conducted for bloggers that are close in interest to each other which are discovered in the first stage. Our experimental results show that both the topic-based and two-level similarity-based methods work well, and the last approach performs much better than the first two. In this paper, we give a detailed analysis of the advantages and disadvantages of different approaches. 1.
A Novel Scalable Algorithm for Supervised Subspace Learning.
Subspace learning approaches aim to discover important statistical distribution on lower dimensions for high dimensional data. Methods such as Principal Component Analysis (PCA) do not make use of the class information, and Linear Discriminant Analysis (LDA) could not be performed efficiently in a scalable way. In this paper, we propose a novel highly scalable supervised subspace learning algorithm called as Supervised Kampong Measure (SKM). It assigns data points as close as possible to their corresponding class mean, simultaneously assigns data points to be as far as possible from the other class means in the transformed lower dimensional subspace. Theoretical derivation shows that our algorithm is not limited by the number of classes or the singularity problem faced by LDA. Furthermore, our algorithm can be executed in an incremental manner in which learning is done in an online fashion as data streams are received. Experimental results on several datasets, including a very large text data set RCV1, show the outstanding performance of our proposed algorithm on classification problems as compared to PCA, LDA and a popular feature selection approach, Information Gain (IG). 1.
Diverse Topic Phrase Extraction through Latent Semantic Analysis.

Adding Semantics to Email Clustering.

Similarity of Temporal Query Logs Based on ARIMA Model.

Similarity of Temporal Query Logs Based on ARIMA Model.

Building bridges for web query classification.
Web query classification (QC) aims to classify Web users’ queries, which are often short and ambiguous, into a set of target categories. QC has many applications including page ranking in Web search, targeted advertisement in response to queries, and personalization. In this paper, we present a novel approach for QC that outperforms the winning solution of the ACM KDDCUP 2005 competition, whose objective is to classify 800,000 real user queries. In our approach, we first build a bridging classifier on an intermediate taxonomy in an offline mode. This classifier is then used in an online mode to map user queries to the target categories via the above intermediate taxonomy. A major innovation is that by leveraging the similarity distribution over the intermediate taxonomy, we do not need to retrain a new classifier for each new set of target categories, and therefore the bridging classifier needs to be trained only once. In addition, we introduce category selection as a new method for narrowing down the scope of the intermediate taxonomy based on which we classify the queries. Category selection can improve both efficiency and effectiveness of the online classification. By combining our algorithm with the winning solution of KDDCUP 2005, we made an improvement by 9.7 % and 3.8 % in terms of precision and F1 respectively compared with the best results of KDDCUP 2005.
Latent semantic analysis for multiple%2Dtype interrelated data objects.
Co-occurrence data is quite common in many real applications. Latent Semantic Analysis (LSA) has been successfully used to identify semantic relations in such data. However, LSA can only handle a single co-occurrence relationship between two types of objects. In practical applications, there are many cases where multiple types of objects exist and any pair of these objects could have a pairwise co-occurrence relation. All these co-occurrence relations can be exploited to alleviate data sparseness or to represent objects more meaningfully. In this paper, we propose a novel algorithm, M-LSA, which conducts latent semantic analysis by incorporating all pairwise co-occurrences among multiple types of objects. Based on the mutual reinforcement principle, M-LSA identifies the most salient concepts among the co-occurrence data and represents all the objects in a unified semantic space. M-LSA is general and we show that several variants of LSA are special cases of our algorithm. Experiment results show that M-LSA outperforms LSA on multiple applications, including collaborative filtering, text clustering, and text categorization.

Thread detection in dynamic text message streams.

CWS a comparative web search system.


Mining clickthrough data for collaborative web search.

Reinforcing Web%2Dobject Categorization Through Interrelationships.
Abstract. Existing categorization algorithms deal with homogeneous Web objects, and consider interrelated objects as additional features when taking the interrelationships with other types of objects into account. However, focusing on any single aspect of the inter-object relationship is not sufficient to fully reveal the true categories of Web objects. In this paper, we propose a novel categorization algorithm, called the Iterative Reinforcement Categorization Algorithm (IRC), to exploit the full interrelationship between different types of Web objects on the Web, including Web pages and queries. IRC classifies the interrelated Web objects by iteratively reinforcing the individual classification results of different types of objects via their interrelationship. Experiments on a clickthrough-log dataset from the MSN search engine show that, in terms of the F1 measure, IRC achieves a 26.4 % improvement over a pure content-based classification method. It also achieves a 21% improvement over a query-metadata-based method, as well as a 16.4 % improvement on F1 measure over the well-known virtual document-based method. Our experiments show that IRC converges fast enough to be applicable to real world applications.
Mining Adaptive Ratio Rules from Distributed Data Sources.
Abstract. Different from traditional association-rule mining, a new paradigm called Ratio Rule (RR) was proposed recently. Ratio rules are aimed at capturing the quantitative association knowledge, We extend this framework to mining ratio rules from distributed and dynamic data sources. This is a novel and challenging problem. The traditional techniques used for ratio rule mining is an eigen-system analysis which can often fall victim to noise. This has limited the application of ratio rule mining greatly. The distributed data sources impose additional constraints for the mining procedure to be robust in the presence of noise, because it is difficult to clean all the data sources in real time in real-world tasks. In addition, the traditional batch methods for ratio rule mining cannot cope with dynamic data. In this paper, we propose an integrated method to mining ratio rules from distributed and changing data sources, by first mining the ratio rules from each data source separately through a novel robust and adaptive one-pass algorithm (which is called Robust and Adaptive Ratio Rule (RARR)), and then integrating the rules of each data source in a simple probabilistic model. In this way, we can acquire the global rules from all the local information sources adaptively. We show that the RARR technique can converge to a fixed point and is robust as well. Moreover, the integration of rules is efficient
Effective and Efficient Dimensionality Reduction for Large%2DScale and Streaming Data Preprocessing.
Abstract—Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the effectiveness of classifiers. Traditional dimensionality reduction approaches fall into two categories: Feature Extraction and Feature Selection. Techniques in the feature extraction category are typically more effective than those in feature selection category. However, they may break down when processing large-scale data sets or data streams due to their high computational complexities. Similarly, the solutions provided by the feature selection approaches are mostly solved by greedy strategies and, hence, are not ensured to be optimal according to optimized criteria. In this paper, we give an overview of the popularly used feature extraction and selection algorithms under a unified framework. Moreover, we propose two novel dimensionality reduction algorithms based on the Orthogonal Centroid algorithm (OC). The first is an Incremental OC (IOC) algorithm for feature extraction. The second algorithm is an Orthogonal Centroid Feature Selection (OCFS) method which can provide optimal solutions according to the OC criterion. Both are designed under the same optimization criterion. Experiments on Reuters Corpus Volume-1 data set and some public large-scale text data sets indicate that the two algorithms are favorable in terms of their effectiveness and efficiency when compared with other state-of-the-art algorithms. Index Terms—Feature extraction, feature selection, orthogonal centroid algorithm. 1
Multitype Features Coselection for Web Document Clustering.

A scalable supervised algorithm for dimensionality reduction on streaming data.

TSSP Multi%2Dfeatures based reinforcement algorithm to find related papers.

KNM A Novel Intelligent User Interface for Webpage Navigation.

A Similarity Reinforcement Algorithm for Heterogeneous Web Pages.

Supervised Semi%2Ddefinite Embedding for Email Data Cleaning and Visualization.

Efficient Text Classification by Weighted Proximal SVM.
In this paper, we present an algorithm that can classify large-scale text data with high classification quality and fast training speed. Our method is based on a novel extension of the proximal SVM mode [3]. Previous studies on proximal SVM have focused on classification for low dimensional data and did not consider the unbalanced data cases. Such methods will meet difficulties when classifying unbalanced and high dimensional data sets such as text documents. In this work, we extend the original proximal SVM by learning a weight for each training error. We show that the classification algorithm based on this model is capable of handling high dimensional and unbalanced data. In the experiments, we compare our method with the original proximal SVM (as a special case of our algorithm) and the standard SVM (such as SVM light) on the recently published RCV1-v2 dataset. The results show that our proposed method had comparable classification quality with the standard SVM. At the same time, both the time and memory consumption of our method are less than that of the standard SVM. 1.
Text Representation From Vector to Tensor.

Supervised semi%2Ddefinite embedding for image manifolds.

Supervised semi%2Ddefinite embedding for image manifolds.

Adaptive Fuzzy Logic Controller with Rule%2Dbased Changeable Universe Of Discourse for a Nonlinear MIMO System.

Scalable collaborative filtering using cluster%2Dbased smoothing.
Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approaches have been shown to suffer from two fundamental problems: data sparsity and difficulty in scalability. Alternatively, the model-based approaches have been proposed to alleviate these problems, but these approaches tends to limit the range of users. In this paper, we present a novel approach that combines the advantages of these two kinds of approaches by introducing a smoothing-based method. In our approach, clusters generated from the training data provide the basis for data smoothing and neighborhood selection. As a result, we provide higher accuracy as well as increased efficiency in recommendations. Empirical studies on two datasets (EachMovie and MovieLens) show that our new proposed approach consistently outperforms other state-of-the-art collaborative filtering algorithms.
OCFS optimal orthogonal centroid feature selection for text categorization.
ABSTRACT 1 Text categorization is an important research area in many Information Retrieval (IR) applications. To save the storage space and computation time in text categorization, efficient and effective algorithms for reducing the data before analysis are highly desired. Traditional techniques for this purpose can generally be classified into feature extraction and feature selection. Because of efficiency, the latter is more suitable for text data such as web documents. However, many popular feature selection techniques such as Information Gain (IG) and 2 χ-test (CHI) are all greedy in nature and thus may not be optimal according to some criterion. Moreover, the performance of these greedy methods may be deteriorated when the reserved data dimension is extremely low. In this paper, we propose an efficient optimal feature selection algorithm by optimizing the objective function of Orthogonal Centroid (OC) subspace learning algorithm in a discrete solution space, called Orthogonal Centroid Feature Selection (OCFS). Experiments on 20 Newsgroups (20NG), Reuters Corpus Volume 1 (RCV1) and Open Directory Project (ODP) data show that OCFS is consistently better than IG and CHI with smaller computation time especially when the reduced dimension is extremely small.
SimFusion measuring similarity using unified relationship matrix.
In this paper we use a Unified Relationship Matrix (URM) to represent a set of heterogeneous data objects (e.g., web pages, queries) and their interrelationships (e.g., hyperlinks, user clickthrough sequences). We claim that iterative computations over the URM can help overcome the data sparseness problem and detect latent relationships among heterogeneous data objects, thus, can improve the quality of information applications that require com-bination of information from heterogeneous sources. To support our claim, we present a unified similarity-calculating algorithm, SimFusion. By iteratively computing over the URM, SimFusion can effectively integrate relationships from heterogeneous sources when measuring the similarity of two data objects. Experiments based on a web search engine query log and a web page collection demonstrate that SimFusion can improve similarity measurement of web objects over both traditional content based algorithms and the cutting edge SimRank algorithm.
Exploiting the hierarchical structure for link analysis.
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hierarchal structure of the Web graph. They often suffer from two problems: the sparsity of link graph and biased ranking of newly-emerging pages. In this paper, we propose a novel ranking algorithm called Hierarchical Rank as a solution to these two problems, which considers both the hierarchical structure and the link structure of the Web. In this algorithm, Web pages are first aggregated based on their hierarchical structure at directory, host or domain level and link analysis is performed on the aggregated graph. Then, the importance of each node on the aggregated graph is distributed to individual pages belong to the node based on the hierarchical structure. This algorithm allows the importance of linked Web pages to be distributed in the Web page space even when the space is sparse and contains new pages. Experimental results on the.GOV collection of TREC 2003 and 2004 show that hierarchical ranking algorithm consistently outperforms other well-known ranking algorithms, including the PageRank, BlockRank and LayerRank. In addition, experimental results show that link aggregation at the host level is much better than link aggregation at either the domain or directory levels.
Web%2Dpage summarization using clickthrough data.
Most previous Web-page summarization methods treat a Web page as plain text. However, such methods fail to uncover the full knowledge associated with a Web page to build a high-quality summary, because the Web contains many hidden relationships that are not used in these methods. Uncovering the inherent knowledge is important to building good Web-page summarizers. In this paper, we extract the extra knowledge from the clickthrough data of a Web search engine to improve Web-page summarization. We first analyze the feasibility to utilize clickthrough data in text summarization, and then propose two adapted summarization methods that take advantage of the relationships discovered from the clickthrough data. For those pages not covered by the clickthrough data, we put forward a thematic lexicon approach to generate implicit knowledge for them. Our methods are evaluated on a relatively small dataset consisting of manually annotated pages as well as a large dataset that is crawled from the Open Directory Project website. The experimental results indicate that significant improvements can be achieved through our proposed summarizer as compared with summarizers without using the clickthrough data. Categories and Subject Descriptors H.4 [Information Systems Applications]: Miscellaneous; I.5.4 [Pattern Recognition]: Applications—Text processing
A study of relevance propagation for web search.
Different from traditional information retrieval, both content and structure are critical to the success of Web information retrieval. In recent years, many relevance propagation techniques have been proposed to propagate content information between web pages through web structure to improve the performance of web search. In this paper, we first propose a generic relevance propagation framework, and then provide a comparison study on the effectiveness and efficiency of various representative propagation models that can be derived from this generic framework. We come to many conclusions that are useful for selecting a propagation model in real-world search applications, including 1) sitemapbased propagation models outperform hyperlink-based models in sense of both effectiveness and efficiency, and 2) sitemap-based term propagation is easier to be integrated into real-world search engines because of its parallel offline implementation and acceptable complexity. Some other more detailed study results are also reported in the paper.
Improving web search results using affinity graph.
In this paper, we propose a novel ranking scheme named Affinity Ranking (AR) to re-rank search results by optimizing two metrics: (1) diversity-- which indicates the variance of topics in a group of documents; (2) information richness-- which measures the coverage of a single document to its topic. Both of the two metrics are calculated from a directed link graph named Affinity Graph (AG). AG models the structure of a group of documents based on the asymmetric content similarities between each pair of documents. Experimental results in Yahoo! Directory, ODP Data, and Newsgroup data demonstrate that our proposed ranking algorithm significantly improves the search performance. Specifically, the algorithm achieves 31 % improvement in diversity and 12 % improvement in information richness relatively within the top 10 search results.
CubeSVD a novel approach to personalized Web search.
As the competition of Web search market increases, there is a high demand for personalized Web search to conduct retrieval incorporating Web users&#039; information needs. This paper focuses on utilizing clickthrough data to improve Web search. Since millions of searches are conducted everyday, a search engine accumulates a large volume of clickthrough data, which records who submits queries and which pages he/she clicks on. The clickthrough data is highly sparse and contains di#erent types of objects (user, query and Web page), and the relationships among these objects are also very complicated. By performing analysis on these data, we attempt to discover Web users&#039; interests and the patterns that users locate information. In this paper, a novel approach CubeSVD is proposed to improve Web search. The clickthrough data is represented by a 3-order tensor, on which we perform 3-mode analysis using the higher-order singular value decomposition technique to automatically capture  the latent factors that govern the relations among these multi-type objects: users, queries and Web pages. A tensor reconstructed based on the CubeSVD analysis reflects both the observed interactions among these objects and the implicit associations among them. Therefore, Web search activities can be carried out based on CubeSVD analysis. Experimental evaluations using a real-world data set collected from an MSN search engine show that CubeSVD achieves encouraging search results in comparison with some standard methods.
An experimental study on large%2Dscale web categorization.
Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification technologies can perform well on and scale up to such large-scale applications. To understand this, we conducted the evaluation of several representative methods (Support Vector Machines, k-Nearest Neighbor and Naive Bayes) with Yahoo! taxonomies. In particular, we evaluated the effectiveness/efficiency tradeoff in classifiers with hierarchical setting compared to conventional (flat) setting, and tested popular threshold tuning strategies for their scalability and accuracy in large-scale classification problems.
Site abstraction for rare category classification in large%2Dscale web directory.

Finding group shilling in recommendation system.

Learning quantifiable associations via principal sparse non%2Dnegative matrix factorization.
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To
additionally capture the quantitative association knowledge, Korn et.al. recently propose a paradigm named Ratio Rules [6] for
quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA), and as a result,
it cannot guarantee that the ratio coefficients are non-negative. This may lead to serious problems in the rules’ application.
In this paper, we propose a new method, called Principal Sparse Non-negative Matrix Factorization (PSNMF), for learning
the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the
importance of each rule for the entire dataset. Experiments on several datasets illustrate that the proposed method performs
well for discovering latent associations between itemsets in large datasets.
Support vector machines classification with a very large%2Dscale taxonomy.
Very large-scale classification taxonomies typically have hundreds
Efficient PageRank with Same Out%2DLink Groups.

Optimizing web search using web click%2Dthrough data.
Search System
MRSSA an iterative algorithm for similarity spreading over interrelated objects.

Web page clustering enhanced by summarization.

Learning similarity measures in non%2Dorthogonal space.
Many machine learning and data mining algorithms crucially rely on the similarity metrics. The Cosine similarity, which calculates the inner product of two normalized feature vectors, is one of the most commonly used similarity measures. However, in many practical tasks such as text categorization and document clustering, the Cosine similarity is calculated under the assumption that the input space is an orthogonal space which usually could not be satisfied due to synonymy and polysemy. Various algorithms such as Latent Semantic Indexing (LSI) were used to solve this problem by projecting the original data into an orthogonal space. However LSI also suffered from the high computational cost and data sparseness. These shortcomings led to increases in computation time and storage requirements for large scale realistic data. In this paper, we propose a novel and effective similarity
Online Supervised Learning for Digital Library.

Improving Text Classification using Local Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been shown to be extremely useful in information retrieval, but it is not an optimal representation for text classification. It always drops the text classification performance when being applied to the whole training set (global LSI) because this completely unsupervised method ignores class discrimination while only concentrating on representation. Some local LSI methods have been proposed to improve the classification by utilizing class discrimination information. However, their performance improvements over original term vectors are still very limited. In this paper, we propose a new local LSI method called “Local Relevancy Weighted LSI ” to improve text classification by performing a separate Single Value Decomposition (SVD) on the transformed local region of each class. Experimental results show that our method is much better than global LSI and traditional local LSI methods on classification within a much smaller LSI dimension. 1.
IRC An Iterative Reinforcement Categorization Algorithm for Interrelated Web Objects.
Most existing categorization algorithms deal with homogeneous Web data objects, and consider interrelated objects as additional features when taking the interrelationships with other types of objects into account. However, focusing on any single aspects of these interrelationships and objects will not fully reveal their true categories. In this paper, we propose a novel categorization algorithm, the Iterative Reinforcement Categorization algorithm (IRC), to exploit the full interrelationships between the heterogeneous objects on the Web. IRC attempts to classify the interrelated Web objects by iterative reinforcement between individual classification results of different types via the interrelationships. Experiments on a clickthrough log dataset from MSN search engine show that, with the F1 measures, IRC achieves a 26.4 % improvement over a pure content-based classification method, a 21% improvement over a query metadata-based method, and a 16.4 % improvement over a virtual document-based method. Furthermore, our experiments show that IRC converges rapidly. 1.
Mining Ratio Rules Via Principal Sparse Non%2DNegative Matrix Factorization.
Association rules are traditionally designed to capture statistical relationship among itemsets in a given database. To additionally capture the quantitative association knowledge, F.Korn et al recently proposed a paradigm named Ratio Rules [4] for quantifiable data mining. However, their approach is mainly based on Principle Component Analysis (PCA) and as a result, it cannot guarantee that the ratio coefficient is non-negative. This may lead to serious problems in the rules’ application. In this paper, we propose a new method, called Principal Sparse Non-Negative Matrix Factoriza-tion (PSNMF), for learning the associations between itemsets in the form of Ratio Rules. In addition, we provide a support measurement to weigh the importance of each rule for the entire dataset. 1.
Supervised Latent Semantic Indexing for Document Categorization.

IMMC incremental maximum margin criterion.
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or large-scale data. To meet this desirability, Incremental Principal Component Analysis (IPCA) algorithm has been well established, but it is an unsupervised subspace learning approach and is not optimal for general classification tasks, such as face recognition and Web document categorization. In this paper, we propose an incremental supervised subspace learning algorithm, called Incremental Maximum Margin Criterion (IMMC), to infer an adaptive subspace by optimizing the Maximum Margin Criterion. We also present the proof for convergence of the proposed algorithm. Experimental results on both synthetic dataset and real world datasets show that IMMC converges to the similar subspace as that of batch approach.
Learning to cluster web search results.
In web search, surfers are often faced with the problem of selecting their most wanted information from the potential huge amount of search results. The clustering of web search results is the possible solution, but the traditional content based clustering is not sufficient since it ignores many unique features of web pages. The link structure, authority, quality, or trustfulness of search results can play even the higher role than the actual contents of the web pages in clustering. These possible extents are reflected by Google&#039;s PageRank algorithm, HITS algorithm and etc. The main goal of this project is to integrate the authoritative information such as PageRank, link structure (e.g. in-links and out-links) into the K-Means clustering of web search results. The PageRank, inlinks and out-links can be used to extend the vector representation of web pages, and the PageRank can also be considered in the initial centroids selection, or the web page with higher PageRank influences the centroid computation to a higher degree. The relevance of this modified K-Means clustering algorithm needs to be compared to the ones obtained by the content based K-Means clustering, and the effects of different authoritative information also needs to be analyzed.
Web%2Dpage classification through summarization.

Exploiting PageRank at Different Block Level.
Abstract. In recent years, information retrieval methods focusing on the link analysis have been developed; The PageRank and HITS are two typical ones According to the hierarchical organization of Web pages, we could partition the Web graph into blocks at different level, such as page level, directory level, host level and domain level. On the basis of block, we could analyze the different hyperlinks among pages. Several approaches proposed that the intrahyperlink in a host maybe less useful in computing the PageRank. However, there are no reports on how concretely the intra- or inter-hyperlink affects the PageRank. Furthermore, based on different block level, inter-hyperlink and intra-hyperlink can be two relative concepts. Thus which level should be optimal to distinguish the intra- or inter-hyperlink? And how the ratio set between the intra-hyperlink and inter-hyperlink could ultimately improve performance of the PageRank algorithm? In this paper, we analyze the link distribution at the different block level and evaluate the importance of the intra- and interhyperlink to PageRank on the TREC Web Track data set. Experiment shows that, if we set the block at host level and the ratio of the weight between the intra-hyperlink and inter-hyperlink is 1:4, the retrieval could achieve the best performance. 1
Multi%2Dtype Features Based Web Document Clustering.
Abstract. Clustering has been demonstrated as a feasible way to explore the contents of document collection and organize search engine results. For this task, many features of Web page, such as content, anchor text, URL, hyperlink etc, can be exploited and different results can be obtained. We expect to provide a unified and even better result for end users. Some work have studied how to use several types of features together to perform clustering. Most of them focus on ensemble method or combination of similarity. In this paper, we propose a novel algorithm: Multi-type Features based Reinforcement Clustering (MFRC). This algorithm does not use a unique combine score for all feature spaces, but uses the intermediate clustering result in one feature space as additional information to gradually enhance clustering in other spaces. Finally a consensus can be achieved by such mutual reinforcement. And the experimental results show that MFRC also provides some performance improvement. 1
Optimizing Web Search Using Spreading Activation on the Clickthrough Data.

Link fusion a unified link analysis framework for multi%2Dtype interrelated data objects.
Web link analysis has proven to be a significant enhancement for quality based web search. Most existing links can be classified into two categories: intra-type links (e.g., web hyperlinks), which represent the relationship of data objects within a homogeneous data type (web pages), and inter-type links (e.g., user browsing log) which represent the relationship of data objects across different data types (users and web pages). Unfortunately, most link analysis research only considers one type of link. In this paper, we propose a unified link analysis framework, called &#034;link fusion&#034;, which considers both the inter- and intra- type link structure among multiple-type inter-related data objects and brings order to objects in each data type at the same time. The PageRank and HITS algorithms are shown to be special cases of our unified link analysis framework. Experiments on an instantiation of the framework that makes use of the user data and web pages extracted from a proxy log show that our proposed algorithm could improve the search effectiveness over the HITS and DirectHit algorithms by 24.6% and 38.2% respectively.
The powerrank web link analysis algorithm.
{byzhang, zhengc,
An Evaluation on Feature Selection for Text Clustering.
Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this paper, we first give empirical evidence that feature selection methods can improve the efficiency and performance of text clustering algorithm. Then we propose a new feature selection method called “Term Contribution (TC) ” and perform a comparative study on a variety of feature selection methods for text clustering, including Document Frequency (DF), Term Strength (TS), Entropy-based (En), Information Gain (IG) and א 2 statistic (CHI). Finally, we propose an “Iterative Feature Selection (IF) ” method that addresses the unavailability of label problem by utilizing effective supervised feature selection method to iteratively select features and perform clustering. Detailed experimental results on Web Directory data are provided in the paper. 1.
Affinity rank a new scheme for efficient web search.
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative documents. In this paper, we propose two new metrics to evaluate the performance of information retrieval: diversity, which measures the topic coverage of a group of documents, and information richness, which measures the amount of information contained in a document. Then we present a novel ranking scheme, Affinity Rank, which utilizes these two metrics to improve search results. We demonstrate how Affinity Rank works by a toy data set, and verify our method by experiments on real-world data sets.
Similarity spreading a unified framework for similarity calculation of interrelated objects.
In many Web search applications, similarities between objects of one type (say, queries) can be affected by the similarities between their interrelated objects of another type (say, Web pages), and vice versa. We propose a novel framework called similarity spreading to take account of the interrelationship and improve the similarity calculation. Experiment results show that the proposed framework can significantly improve the accuracy of the similarity measurement of the objects in a search engine. Categories &amp; Subject Descriptors:
TSSP A Reinforcement Algorithm to Find Related Papers.
Content analysis and citation analysis are two common methods in recommending system. Compared with content analysis, citation analysis can discover more implicitly related papers. However, the citation-based methods may introduce more noise in citation graph and cause topic drift. Some work combine content with citation to improve similarity measurement. The problem is that the two features are not used to reinforce each other to get better result. To solve the problem, we propose a new algorithm, Topic Sensitive Similarity Propagation (TSSP), to effectively integrate content similarity into similarity propagation. TSSP has two parts: citation context based propagation and iterative reinforcement. First, citation contexts provide clues for which papers are topic related to and filter out less irrelevant citations. Second, iteratively integrating content and citation similarity enable them to reinforce each other during the propagation. The experimental results of a user study show TSSP outperforms other algorithms in almost all cases. 1.
GE%2DCKO A Method to Optimize Composite Kernels for Web Page Classification.
Most of current researches on Web page classification focus on leveraging heterogeneous features such as plain text, hyperlinks and anchor texts in an effective and efficient way. Composite kernel method is one topic of interest among them. It first selects a bunch of initial kernels, each of which is determined separately by a certain type of features. Then a classifier is trained based on a linear combination of these kernels. In this paper, we propose an effective way to optimize the linear combination of kernels. We proved that this problem is equivalent to solving a generalized eigenvalue problem. And the weight vector of the kernels is the eigenvector associated with the largest eigenvalue. A support vector machine (SVM) classifier is then trained based on this optimized combination of kernels. Our experiment on the WebKB dataset has shown the effectiveness of the proposed method. 1.
CBC Clustering Based Text Classification Requiring Minimal Labeled Data.
Semi-supervised learning methods construct classifiers using both labeled and  unlabeled training data samples. While unlabeled data samples can help to improve the accuracy  of trained models to certain extent, existing methods still face difficulties when labeled data is  not sufficient and biased against the underlying data distribution. In this paper, we present a  clustering based classification (CBC) approach. Using this approach, training data, including  both the labeled and unlabeled data, is first clustered with the guidance of the labeled data. Some  of unlabeled data samples are then labeled based on the clusters obtained. Discriminative  classifiers can subsequently be trained with the expanded labeled dataset. The effectiveness of  the proposed method is justified analytically. Related issues such as expanding labeled dataset  and interacting clustering with classification are discussed. Our experimental results  demonstrated that CBC outperforms existing algorithms when the size of labeled dataset is very  small.
An Evaluation on Feature Selection for Text Clustering.
Feature selection methods have been successfully applied to text categorization but seldom applied to text clustering due to the unavailability of class label information. In this paper, we first give empirical evidence that feature selection methods can improve the efficiency and performance of text clustering algorithm. Then we propose a new feature selection method called “Term Contribution (TC) ” and perform a comparative study on a variety of feature selection methods for text clustering, including Document Frequency (DF), Term Strength (TS), Entropy-based (En), Information Gain (IG) and א 2 statistic (CHI). Finally, we propose an “Iterative Feature Selection (IF) ” method that addresses the unavailability of label problem by utilizing effective supervised feature selection method to iteratively select features and perform clustering. Detailed experimental results on Web Directory data are provided in the paper. 1.
Building a web thesaurus from web link structure.
Thesaurus has been widely used in many applications, including information retrieval, natural language processing, and question answering. In this paper, we propose a novel approach to automatically constructing a domain-specific thesaurus from the Web using link structure information. The proposed approach is able to identify new terms and reflect the latest relationship between terms as the Web evolves. First, a set of high quality and representative websites of a specific domain is selected. After filtering out navigational links, link analysis is applied to each website to obtain its content structure. Finally, the thesaurus is constructed by merging the content structures of the selected websites. The experimental results on automatic query expansion based on our constructed thesaurus show 20% improvement in search precision compared to the baseline.
Implicit link analysis for small web search.

User Access Pattern Enhanced Small Web Search.

Ubiquitous media agents a framework for managing personally accumulated multimedia files.

Relevance Feedback and Learning in Content%2DBased Image Search.


A New Statistical Approach to Personal Name Extraction.
We propose a new statistical approach to  extracting personal names from a corpus. One of  the key points of our approach is that it can both  automatically learn the characteristics of  personal names from a large training corpus and  make good use of human empirical knowledge  (e.g., Context Free Grammar). Furthermore, our  approach also assigns confidence measures to the  extracted personal names, compared with  traditional simple true/false determination.

A Unified Framework for Clustering Heterogeneous Web Objects.
In this paper, we introduce a novel framework for clustering web data which is often heterogeneous in nature. As most existing methods often integrate heterogeneous data into a unified feature space, their flexibilities to explore and adjust contributing effect from different heterogeneous information are compromised. In contrast, our framework enables separate clustering of homogeneous data in the entire process based on their respective features, and a layered structure with link information is used to iteratively project and propagate the clustered results between layers until it converges. Our experimental results show that such a scheme not only effectively overcomes the problem of data sparseness caused by the high dimensional link space but also improves the clustering accuracy significantly. We achieve 19% and 41% performance increases when clustering web-pages and users based on a semi-synthetic web log. Finally, we show a real clustering result based on UC Berkeley&#039;s web log.
A Unified Framework for Web Link Analysis.
Web link analysis has been proved to provide significant enhancement to the precision of web search in practice. Among existing approaches, Kleinberg&#039;s HITS and Google&#039;s PageRank are the two most representative algorithms that employ explicit hyperlinks structure among web pages to conduct link analysis, and DirectHit represents the other extreme that takes the user&#039;s access frequency as implicit link to the web page for counting its importance. In this paper, we propose a novel link analysis algorithm which puts both explicit and implicit link structures under a unified framework, and show that HITS and DirectHit are essentially the two extreme instances of our proposed method. One important advantage of our method is its ability to analyze not only the hyperlinks between web-pages but also the interactions between the users and the Web at the same time. The importance of web-pages and users can reinforce each other to improve the Web link analysis. Compared with traditional HITS and DirectHit algorithms, our method further improves the search precision by 11.8% and 25.3%.
Log Mining to Improve the Performance of Site Search.
Despite of the popularity of global search engines, people still suffer from low accuracy of site search. The primary reason lies in the difference of link structures and data scale between global Web and website, which leads&#039; to failures of traditional re-ranking methods&#039; such as HITS, PageRank and DirectHit. This&#039; paper proposes a novel re-ranking method based on user logs within websites. With the help of website taxonomy, we mine for generalized association rules and abstract access patterns of different levels&#039;. Mining results&#039; are subsequently used to re-rank the retrieved pages. One of  the advantages of our mining algorithm is that it resolves the diversity problem of user&#039;s&#039; access behavior and discovers&#039; general patterns. Experiment shows that the proposed method outperforms keyword-based method by 15% and DirectHit by 13% respectively.
Statistical correlation analysis in image retrieval.
A statistical correlation model for image retrieval is proposed. This model captures the semantic relationships among images in a database from simple statistics of userprovided relevance feedback information. It is applied in the post-processing of image retrieval results such that more semantically related images are returned to the user. The algorithm is easy to implement and can be efficiently integrated into an image retrieval system to help improve the retrieval performance. Preliminary experimental results on a database of 100,000 images show that the proposed model could improve image retrieval performance for both content-based and text-based queries.
User Intention Modelling in Web Applications Using Data Mining.
The problem of inferring a user&#039;s intentions in Machine--Human Interaction has been the key research issue for providing personalized experiences and services. In this paper, we propose novel approaches on modeling and inferring user&#039;s actions in a computer. Two linguistic features -- keyword and concept features -- are extracted from the semantic context for intention modeling. Concept features are the conceptual generalization of keywords. Association rule mining is used to find the proper concept of corresponding keyword. A modified Nave Bayes classifier is used in our intention modeling. Experimental results have shown that our proposed approach achieved 84% average accuracy in predicting user&#039;s intention, which is close to the precision (92%) of human prediction.
Ubiquitous media agents for managing personal multimedia files.
A novel idea of ubiquitous media agents is presented. Media agents are intelligent systems that are able to automatically collect and build personalized semantic indices of multimedia data on behalf of the user whenever and wherever he/she accesses/uses these multimedia data. The sources of these semantic descriptions are the textual context of the same documents that contain these multimedia data. The URLs of these multimedia data are indexed using these textual features. When the user wants to use these multimedia data once again, the media agents can also help the user find relevant multimedia data and provide proper suggestions based on the semantic indices. The media agents can also learn form the user&#039;s interaction records to refine the semantic indices and to model the user intentions and preferences. In our experiments, the media agents are effective in gathering relevant semantics for media objects and learning to provide precise suggestions when the user wants to re-use relevant media objects again.
User Modeling for Efficient Use of Multimedia Files.
It is very common that a user likes to collect many multimedia files  of their interests from the web or other sources for his/her daily use, such as in  emails, presentations, and technical documents. This paper presents algorithms  to learn user models, in particular, user intention models and preference models  from the usage of these files. Such usages include downloading, inserting, and  sending multimedia files. A user intention model predicts when the user may  want to involve some multimedia objects in his currently working environment  (e.g., an email) and provides more convenient and accurate help to the user. A  user preference model describes the types and classes of the user&#039;s favorite multimedia  files and helps an offline crawler to autonomously collect more useful  multimedia files for the user. The algorithms have been implemented in our  media agents system and shown their effectiveness in user modeling.
IFind A Web Image Search Engine.
Introduction  iFind (v1.0) is a web-based image retrieval system developed at Microsoft Research China. It provides the functionalities of text based image search, query by image example, and their combination. Images in the database are indexed by their lowlevel (visual) features, high-level (semantic) features (collected from image&#039;s environment, e.g., the Web), and optionally, annotations if they are available. The key technology in the system is the integrated semantics and feature based image retrieval and relevance feedback approach and data mining of users&#039; feedback log. When the user provides feedback images, the system can refine the retrieval result based on the user&#039;s feedback. In the meantime, the system updates the annotation of feedback images by increasing the linkage to the positive examples&#039; annotation and decreasing the linkage to the negative examples&#039; annotation. The updated annotation can further help to improve image retrieval results of the system in later use. L
A Web Media Agent.

Web mining for Web image retrieval.
The popularity of digital images is rapidly increasing due to improving digital imaging technologies and convenient availability facilitated by the Internet. However, how to find user-intended images from the Internet is non-trivial. The main reason is that the web images are usually not annotated using semantic descriptors.
A media agent for automatically building a personalized semantic index of Web media objects.

A New Statistical Approach To Chinese Pinyin Input.
Chinese input is one of the key challenges for Chinese PC users. This paper proposes a statistical approach to Pinyin-based Chinese input. This approach uses a trigram-based language model and a statistically based segmentation. Also, to deal with real input, it also includes a typing model which enables spelling correction in sentence-based Pinyin input, and a spelling model for English which enables modeless Pinyin input.
Reliability and Availability Analysis of Manhattan Street Network.

